________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        05.02.2010 03:45:04
Input Data from:  dataset242.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :40
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,142333333333333
Average f[i]   :5012,5
Average g[i,j] :1983,78378378378
Total demand   :16740
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 149
> Selected Move:	5090	1	-1	6	5500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5090


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 84
> Selected Move:	6230	1	-1	3	11500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 6230


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 147
> Selected Move:	7580	1	-1	7	17000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 7580


> New S[]: 
	
	 0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 108
> Selected Move:	8730	1	-1	8	22000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 8730


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 113
> Selected Move:	9420	3	0	11	24300


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 9420


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 19
> Selected Move:	10020	3	3	14	24300


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 10020


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 125
> Selected Move:	10500	3	8	22	24300


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 10500


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 211
> Selected Move:	10510	3	6	17	24300


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  0  0  2  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 10510


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 219
> Selected Move:	10820	3	22	21	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  0  0  2  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 10820


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 163
> Selected Move:	11270	3	7	28	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  2  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 11270


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 151
> Selected Move:	11270	4	11	14	23700


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 172
> Selected Move:	11270	4	14	17	24100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 166
> Selected Move:	11270	4	17	21	24900


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 147
> Selected Move:	11270	4	21	28	24200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 183
> Selected Move:	11270	3	11	25	23200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 120
> Selected Move:	11270	4	28	14	22700


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 123
> Selected Move:	11270	4	14	17	23100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 121
> Selected Move:	11270	4	17	21	23900


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  2  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 111
> Selected Move:	11270	4	21	25	24100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 127
> Selected Move:	11270	3	25	12	24900


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  2  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 167
> Selected Move:	11270	4	12	14	24700


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  1  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 192
> Selected Move:	11270	3	12	38	23200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 104
> Selected Move:	11400	3	1	18	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 11400


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 145
> Selected Move:	11430	3	21	9	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 11430


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 137
> Selected Move:	11430	4	18	9	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 136
> Selected Move:	11430	3	18	30	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 131
> Selected Move:	11430	3	28	29	24300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 121
> Selected Move:	11430	4	9	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  3  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 111
> Selected Move:	11430	4	14	17	24200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 123
> Selected Move:	11430	4	14	9	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 113
> Selected Move:	11430	3	30	18	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 134
> Selected Move:	11430	4	9	14	24200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  2  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 144
> Selected Move:	11430	4	14	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 137
> Selected Move:	11430	4	17	9	24300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 141
> Selected Move:	11430	4	9	18	24300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 144
> Selected Move:	11430	4	14	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 140
> Selected Move:	11400	3	9	21	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  3  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 149
> Selected Move:	11400	4	17	14	24300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  3  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 151
> Selected Move:	11400	4	14	18	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  2  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 150
> Selected Move:	11430	3	21	9	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 145
> Selected Move:	11430	3	18	30	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 115
> Selected Move:	11430	4	14	30	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 112
> Selected Move:	11430	4	30	29	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 111
> Selected Move:	11430	3	30	18	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 140
> Selected Move:	11400	3	9	21	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 147
> Selected Move:	11400	4	29	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  3  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 146
> Selected Move:	11400	4	14	17	24200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  2  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 150
> Selected Move:	11400	4	14	21	24500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 149
> Selected Move:	11400	4	17	14	24100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 151
> Selected Move:	11400	4	14	18	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  2  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 155
> Selected Move:	11374	3	21	9	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 148
> Selected Move:	11320	3	18	30	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 119
> Selected Move:	11346	3	9	21	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 108
> Selected Move:	11400	4	21	14	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 118
> Selected Move:	11400	4	14	30	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 116
> Selected Move:	11400	4	30	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  3  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 121
> Selected Move:	11400	4	14	17	24200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  2  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 127
> Selected Move:	11409	3	38	12	25700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  3  0  0  2  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 156
> Selected Move:	11508	4	14	12	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 59 #######################


> Neighbours evaluated; 148
> Selected Move:	11580	4	17	14	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0    >new incumb.: 11580


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 60 #######################


> Neighbours evaluated; 163
> Selected Move:	11550	3	30	18	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  2  0  0  1  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 61 #######################


> Neighbours evaluated; 179
> Selected Move:	11477	4	14	17	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  1  0  0  2  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 62 #######################


> Neighbours evaluated; 178
> Selected Move:	11382	4	12	14	25700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  3  0  0  2  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 63 #######################


> Neighbours evaluated; 171
> Selected Move:	11433	4	17	12	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  2  0  3  0  0  1  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 64 #######################


> Neighbours evaluated; 175
> Selected Move:	11460	3	18	30	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  2  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 65 #######################


> Neighbours evaluated; 162
> Selected Move:	11385	3	29	28	26000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  2  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 66 #######################


> Neighbours evaluated; 156
> Selected Move:	11530	4	12	14	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 160
> Selected Move:	11448	3	30	18	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  2  0  0  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 68 #######################


> Neighbours evaluated; 177
> Selected Move:	11342	4	14	17	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  1  0  0  2  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 69 #######################


> Neighbours evaluated; 177
> Selected Move:	11418	3	18	30	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 70 #######################


> Neighbours evaluated; 159
> Selected Move:	11387	4	17	28	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 71 #######################


> Neighbours evaluated; 165
> Selected Move:	11303	3	30	18	25900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  3  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 72 #######################


> Neighbours evaluated; 179
> Selected Move:	11186	4	12	14	26300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  3  0  0  1  1  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 73 #######################


> Neighbours evaluated; 157
> Selected Move:	11400	3	12	38	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 74 #######################


> Neighbours evaluated; 152
> Selected Move:	11430	3	21	9	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 75 #######################


> Neighbours evaluated; 147
> Selected Move:	11430	4	28	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  2  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 76 #######################


> Neighbours evaluated; 145
> Selected Move:	11430	3	18	30	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  2  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 77 #######################


> Neighbours evaluated; 133
> Selected Move:	11430	4	17	28	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 78 #######################


> Neighbours evaluated; 134
> Selected Move:	11400	3	9	21	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 79 #######################


> Neighbours evaluated; 137
> Selected Move:	11400	4	28	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  2  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 80 #######################


> Neighbours evaluated; 136
> Selected Move:	11400	4	14	21	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  3  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 81 #######################


> Neighbours evaluated; 136
> Selected Move:	11400	4	17	14	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  3  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 82 #######################


> Neighbours evaluated; 140
> Selected Move:	11400	3	28	29	24100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 83 #######################


> Neighbours evaluated; 125
> Selected Move:	11409	3	38	12	25600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  2  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 84 #######################


> Neighbours evaluated; 161
> Selected Move:	11382	3	30	18	25600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  2  0  0  1  1  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 85 #######################


> Neighbours evaluated; 175
> Selected Move:	11330	4	14	12	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  2  0  1  0  0  1  1  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 86 #######################


> Neighbours evaluated; 177
> Selected Move:	11364	3	18	30	25800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  2  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 87 #######################


> Neighbours evaluated; 163
> Selected Move:	11315	4	12	17	26000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  1  0  0  2  0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 88 #######################


> Neighbours evaluated; 160
> Selected Move:	11400	3	12	38	24500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 89 #######################


> Neighbours evaluated; 125
> Selected Move:	11345	4	21	29	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 90 #######################


> Neighbours evaluated; 103
> Selected Move:	11400	4	17	14	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 91 #######################


> Neighbours evaluated; 112
> Selected Move:	11372	4	29	38	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 92 #######################


> Neighbours evaluated; 114
> Selected Move:	11401	3	21	9	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 93 #######################


> Neighbours evaluated; 113
> Selected Move:	11401	3	30	18	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 94 #######################


> Neighbours evaluated; 142
> Selected Move:	11370	4	14	38	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 95 #######################


> Neighbours evaluated; 130
> Selected Move:	11400	4	38	9	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  2  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 96 #######################


> Neighbours evaluated; 131
> Selected Move:	11400	3	9	21	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  2  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 97 #######################


> Neighbours evaluated; 143
> Selected Move:	11400	3	18	30	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  2  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 98 #######################


> Neighbours evaluated; 113
> Selected Move:	11398	3	21	9	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  2  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 99 #######################


> Neighbours evaluated; 107
> Selected Move:	11365	4	9	38	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 100 #######################


> Neighbours evaluated; 114
> Selected Move:	11334	3	9	21	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 101 #######################


> Neighbours evaluated; 114
> Selected Move:	11333	3	30	18	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 102 #######################


> Neighbours evaluated; 133
> Selected Move:	11366	4	14	38	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 103 #######################


> Neighbours evaluated; 144
> Selected Move:	11228	4	14	17	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 104 #######################


> Neighbours evaluated; 123
> Selected Move:	11330	4	38	29	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 105 #######################


> Neighbours evaluated; 142
> Selected Move:	11359	3	21	9	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 106 #######################


> Neighbours evaluated; 130
> Selected Move:	11358	3	18	30	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 107 #######################


> Neighbours evaluated; 113
> Selected Move:	11321	4	29	30	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 108 #######################


> Neighbours evaluated; 113
> Selected Move:	11320	3	30	15	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  3  0  2  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 109 #######################


> Neighbours evaluated; 117
> Selected Move:	11320	4	17	14	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 110 #######################


> Neighbours evaluated; 142
> Selected Move:	11282	3	29	28	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  3  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 111 #######################


> Neighbours evaluated; 132
> Selected Move:	11276	3	15	30	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 112 #######################


> Neighbours evaluated; 126
> Selected Move:	11391	4	30	28	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 113 #######################


> Neighbours evaluated; 129
> Selected Move:	11391	3	30	18	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 114 #######################


> Neighbours evaluated; 134
> Selected Move:	11360	3	9	21	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 115 #######################


> Neighbours evaluated; 132
> Selected Move:	11400	4	28	21	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 116 #######################


> Neighbours evaluated; 140
> Selected Move:	11400	4	14	17	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 117 #######################


> Neighbours evaluated; 140
> Selected Move:	11400	4	21	14	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  2  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 118 #######################


> Neighbours evaluated; 144
> Selected Move:	11316	4	14	17	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  3  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 119 #######################


> Neighbours evaluated; 138
> Selected Move:	11345	3	21	9	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  3  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 120 #######################


> Neighbours evaluated; 136
> Selected Move:	11344	3	18	30	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 121 #######################


> Neighbours evaluated; 128
> Selected Move:	11313	3	9	21	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  3  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 122 #######################


> Neighbours evaluated; 126
> Selected Move:	11356	4	17	28	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 123 #######################


> Neighbours evaluated; 133
> Selected Move:	11222	4	28	30	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 124 #######################


> Neighbours evaluated; 128
> Selected Move:	11220	4	14	30	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 125 #######################


> Neighbours evaluated; 126
> Selected Move:	11309	3	30	18	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  2  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 126 #######################


> Neighbours evaluated; 135
> Selected Move:	11338	3	21	9	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 127 #######################


> Neighbours evaluated; 138
> Selected Move:	11244	3	18	30	25400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 128 #######################


> Neighbours evaluated; 126
> Selected Move:	11243	3	30	35	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 129 #######################


> Neighbours evaluated; 106
> Selected Move:	11260	3	28	29	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 130 #######################


> Neighbours evaluated; 92
> Selected Move:	11260	4	14	35	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 131 #######################


> Neighbours evaluated; 89
> Selected Move:	11260	4	35	9	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 132 #######################


> Neighbours evaluated; 93
> Selected Move:	11211	4	14	35	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 133 #######################


> Neighbours evaluated; 81
> Selected Move:	11210	3	9	21	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 134 #######################


> Neighbours evaluated; 87
> Selected Move:	11210	4	21	14	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 135 #######################


> Neighbours evaluated; 94
> Selected Move:	11210	4	14	35	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 136 #######################


> Neighbours evaluated; 88
> Selected Move:	11240	3	35	15	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  3  0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 137 #######################


> Neighbours evaluated; 124
> Selected Move:	11240	4	14	17	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  3  0  2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 138 #######################


> Neighbours evaluated; 119
> Selected Move:	11253	3	15	30	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 139 #######################


> Neighbours evaluated; 102
> Selected Move:	11162	3	30	35	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 140 #######################


> Neighbours evaluated; 91
> Selected Move:	11212	3	21	9	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 141 #######################


> Neighbours evaluated; 84
> Selected Move:	11260	4	35	14	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  3  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 142 #######################


> Neighbours evaluated; 99
> Selected Move:	11210	3	9	21	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 143 #######################


> Neighbours evaluated; 95
> Selected Move:	11210	4	14	21	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 144 #######################


> Neighbours evaluated; 85
> Selected Move:	11210	4	17	14	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 145 #######################


> Neighbours evaluated; 104
> Selected Move:	11165	3	29	28	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 146 #######################


> Neighbours evaluated; 117
> Selected Move:	11155	3	21	9	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 147 #######################


> Neighbours evaluated; 103
> Selected Move:	11199	4	9	35	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 148 #######################


> Neighbours evaluated; 114
> Selected Move:	11118	3	9	21	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 149 #######################


> Neighbours evaluated; 110
> Selected Move:	11194	3	35	15	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  3  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 150 #######################


> Neighbours evaluated; 125
> Selected Move:	11193	3	21	6	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  3  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 151 #######################


> Neighbours evaluated; 124
> Selected Move:	11200	3	15	18	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 152 #######################


> Neighbours evaluated; 140
> Selected Move:	11200	4	18	6	24600


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 153 #######################


> Neighbours evaluated; 143
> Selected Move:	11200	4	6	14	24900


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 154 #######################


> Neighbours evaluated; 139
> Selected Move:	11200	4	6	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  2  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 155 #######################


> Neighbours evaluated; 142
> Selected Move:	11200	4	14	6	25000


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 156 #######################


> Neighbours evaluated; 129
> Selected Move:	11330	3	6	9	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 157 #######################


> Neighbours evaluated; 120
> Selected Move:	11329	4	9	18	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 158 #######################


> Neighbours evaluated; 123
> Selected Move:	11298	3	9	21	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 159 #######################


> Neighbours evaluated; 129
> Selected Move:	11270	3	18	1	23600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 160 #######################


> Neighbours evaluated; 100
> Selected Move:	11270	4	17	21	24400


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 161 #######################


> Neighbours evaluated; 91
> Selected Move:	11270	4	21	28	23700


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 162 #######################


> Neighbours evaluated; 100
> Selected Move:	11270	4	28	38	24600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 163 #######################


> Neighbours evaluated; 140
> Selected Move:	11090	3	17	31	24600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 164 #######################


> Neighbours evaluated; 120
> Selected Move:	11090	4	38	14	23200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 165 #######################


> Neighbours evaluated; 131
> Selected Move:	11210	3	1	18	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  3  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 166 #######################


> Neighbours evaluated; 173
> Selected Move:	11210	4	18	21	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  3  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 167 #######################


> Neighbours evaluated; 176
> Selected Move:	11262	3	31	36	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 168 #######################


> Neighbours evaluated; 136
> Selected Move:	11310	4	21	36	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 169 #######################


> Neighbours evaluated; 151
> Selected Move:	11310	3	18	30	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 170 #######################


> Neighbours evaluated; 148
> Selected Move:	11264	4	36	21	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 171 #######################


> Neighbours evaluated; 153
> Selected Move:	11230	3	30	25	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  3  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,45

## ITERATION 172 #######################


> Neighbours evaluated; 191
> Selected Move:	11230	4	21	36	24400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 173 #######################


> Neighbours evaluated; 198
> Selected Move:	11230	4	14	28	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  2  0  0  0  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 174 #######################


> Neighbours evaluated; 190
> Selected Move:	11230	4	36	14	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  1  0  0  2  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 175 #######################


> Neighbours evaluated; 189
> Selected Move:	11230	4	28	36	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 176 #######################


> Neighbours evaluated; 191
> Selected Move:	11144	4	14	21	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  3  0  0  0  1  0  0  1  0  0  0  0  0  0  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 177 #######################


> Neighbours evaluated; 183
> Selected Move:	11188	4	36	28	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  3  0  0  0  1  0  0  2  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 178 #######################


> Neighbours evaluated; 197
> Selected Move:	11058	3	25	18	25600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  3  0  0  0  0  0  0  2  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 179 #######################


> Neighbours evaluated; 134
> Selected Move:	11359	3	36	17	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  3  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 180 #######################


> Neighbours evaluated; 144
> Selected Move:	11358	3	18	30	25100


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 181 #######################


> Neighbours evaluated; 135
> Selected Move:	11303	3	21	9	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 182 #######################


> Neighbours evaluated; 128
> Selected Move:	11344	4	28	17	25200


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 183 #######################


> Neighbours evaluated; 130
> Selected Move:	11213	4	9	28	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 184 #######################


> Neighbours evaluated; 132
> Selected Move:	11210	3	30	18	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 185 #######################


> Neighbours evaluated; 134
> Selected Move:	11178	3	9	21	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 186 #######################


> Neighbours evaluated; 139
> Selected Move:	11175	3	18	30	25500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  1  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 187 #######################


> Neighbours evaluated; 136
> Selected Move:	11110	3	14	39	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 188 #######################


> Neighbours evaluated; 110
> Selected Move:	11160	3	30	18	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 189 #######################


> Neighbours evaluated; 109
> Selected Move:	11160	4	28	18	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 190 #######################


> Neighbours evaluated; 114
> Selected Move:	11160	4	17	28	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 191 #######################


> Neighbours evaluated; 111
> Selected Move:	11258	3	39	14	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 192 #######################


> Neighbours evaluated; 144
> Selected Move:	11286	3	21	9	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 193 #######################


> Neighbours evaluated; 132
> Selected Move:	11284	4	18	9	25300


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 194 #######################


> Neighbours evaluated; 139
> Selected Move:	11151	3	9	6	25100


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 195 #######################


> Neighbours evaluated; 136
> Selected Move:	11200	4	6	14	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 196 #######################


> Neighbours evaluated; 138
> Selected Move:	11200	3	18	30	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 197 #######################


> Neighbours evaluated; 135
> Selected Move:	11200	4	28	6	24900


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 198 #######################


> Neighbours evaluated; 135
> Selected Move:	11200	4	6	14	24600


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 199 #######################


> Neighbours evaluated; 136
> Selected Move:	11200	4	14	17	25000


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 200 #######################


> Neighbours evaluated; 134
> Selected Move:	11200	4	6	14	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  2  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 201 #######################


> Neighbours evaluated; 139
> Selected Move:	11200	3	28	29	24200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 202 #######################


> Neighbours evaluated; 130
> Selected Move:	11200	4	14	6	24500


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 203 #######################


> Neighbours evaluated; 122
> Selected Move:	11200	4	17	14	24100


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 204 #######################


> Neighbours evaluated; 130
> Selected Move:	11200	4	6	14	24400


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 205 #######################


> Neighbours evaluated; 121
> Selected Move:	11200	4	6	30	24900


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 206 #######################


> Neighbours evaluated; 112
> Selected Move:	11200	4	14	30	24900


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 207 #######################


> Neighbours evaluated; 112
> Selected Move:	11200	4	30	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  3  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 208 #######################


> Neighbours evaluated; 117
> Selected Move:	11200	4	17	29	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 209 #######################


> Neighbours evaluated; 119
> Selected Move:	11200	3	30	18	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 210 #######################


> Neighbours evaluated; 142
> Selected Move:	11200	4	29	6	24100


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 211 #######################


> Neighbours evaluated; 151
> Selected Move:	11200	4	6	14	24400


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 212 #######################


> Neighbours evaluated; 147
> Selected Move:	11200	4	6	17	24200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  2  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 213 #######################


> Neighbours evaluated; 151
> Selected Move:	11200	4	14	6	24500


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 214 #######################


> Neighbours evaluated; 144
> Selected Move:	11200	4	6	18	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 215 #######################


> Neighbours evaluated; 147
> Selected Move:	11200	4	17	6	24900


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 216 #######################


> Neighbours evaluated; 147
> Selected Move:	11200	4	6	14	24300


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 217 #######################


> Neighbours evaluated; 149
> Selected Move:	11200	4	14	18	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 218 #######################


> Neighbours evaluated; 142
> Selected Move:	11200	4	14	6	25000


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 219 #######################


> Neighbours evaluated; 151
> Selected Move:	11150	3	29	20	24000


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  1  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 220 #######################


> Neighbours evaluated; 170
> Selected Move:	11150	4	6	14	23700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 221 #######################


> Neighbours evaluated; 171
> Selected Move:	11150	4	14	17	24600


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  3  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 222 #######################


> Neighbours evaluated; 160
> Selected Move:	11150	4	17	18	23700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 223 #######################


> Neighbours evaluated; 171
> Selected Move:	11150	4	17	6	23900


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 224 #######################


> Neighbours evaluated; 168
> Selected Move:	11150	4	6	14	23300


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 225 #######################


> Neighbours evaluated; 170
> Selected Move:	11150	4	14	38	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 226 #######################


> Neighbours evaluated; 158
> Selected Move:	11150	4	18	6	24500


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 227 #######################


> Neighbours evaluated; 164
> Selected Move:	11150	4	6	14	24200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 228 #######################


> Neighbours evaluated; 165
> Selected Move:	11150	4	14	38	24100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 229 #######################


> Neighbours evaluated; 166
> Selected Move:	11167	3	20	29	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 230 #######################


> Neighbours evaluated; 141
> Selected Move:	11200	4	38	17	24700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 231 #######################


> Neighbours evaluated; 150
> Selected Move:	11150	3	29	20	23700


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 232 #######################


> Neighbours evaluated; 170
> Selected Move:	11150	4	14	6	24300


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 233 #######################


> Neighbours evaluated; 165
> Selected Move:	11150	4	6	17	23500


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  2  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 234 #######################


> Neighbours evaluated; 169
> Selected Move:	11150	4	6	14	23200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  2  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 235 #######################


> Neighbours evaluated; 168
> Selected Move:	11150	4	14	20	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 236 #######################


> Neighbours evaluated; 160
> Selected Move:	11150	4	17	6	25000


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  1  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 237 #######################


> Neighbours evaluated; 156
> Selected Move:	11150	4	6	14	24400


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 238 #######################


> Neighbours evaluated; 163
> Selected Move:	11171	3	20	28	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 239 #######################


> Neighbours evaluated; 148
> Selected Move:	11172	3	18	30	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 240 #######################


> Neighbours evaluated; 140
> Selected Move:	11144	4	28	17	25200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 241 #######################


> Neighbours evaluated; 143
> Selected Move:	11145	3	30	18	25200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  3  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 242 #######################


> Neighbours evaluated; 151
> Selected Move:	11100	3	17	36	24900


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 243 #######################


> Neighbours evaluated; 186
> Selected Move:	11180	3	6	31	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 244 #######################


> Neighbours evaluated; 210
> Selected Move:	11180	3	28	20	23400


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 245 #######################


> Neighbours evaluated; 168
> Selected Move:	11198	3	2	4	25400


> New Y[]: 
	
	 0  0  0  0  4  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 246 #######################


> Neighbours evaluated; 141
> Selected Move:	11300	4	4	18	23900


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  4  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 247 #######################


> Neighbours evaluated; 158
> Selected Move:	11344	1	-1	21	29400


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  4  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 248 #######################


> Neighbours evaluated; 160
> Selected Move:	11366	3	36	1	27200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  4  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 249 #######################


> Neighbours evaluated; 142
> Selected Move:	11445	3	31	17	27200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  1  4  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 250 #######################


> Neighbours evaluated; 211
> Selected Move:	11406	4	18	17	27300


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  4  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 251 #######################


> Neighbours evaluated; 187
> Selected Move:	11509	4	14	17	26900


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  4  0  0  2  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 252 #######################


> Neighbours evaluated; 209
> Selected Move:	11604	3	18	25	26400


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  4  0  0  2  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 253 #######################


> Neighbours evaluated; 209
> Selected Move:	11568	3	17	31	26500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  4  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 254 #######################


> Neighbours evaluated; 211
> Selected Move:	11430	1	-1	16	31000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  4  0  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 255 #######################


> Neighbours evaluated; 223
> Selected Move:	11410	3	38	22	31000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  4  0  1  0  0  0  1  1  1  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 256 #######################


> Neighbours evaluated; 144
> Selected Move:	11525	2	21	-1	25500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  4  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 257 #######################


> Neighbours evaluated; 178
> Selected Move:	11523	3	14	37	25500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  2  0  0  0  0  0  4  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0 
 > pw :0,32

## ITERATION 258 #######################


> Neighbours evaluated; 141
> Selected Move:	11488	3	37	39	25600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 259 #######################


> Neighbours evaluated; 110
> Selected Move:	11453	4	39	22	25700


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  4  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,33
________________________________________________________________

Best solution found: 11580
Run Termination time: 05.02.2010 03:57:58
Run duration: 00:12:53.5781250
________________________________________________________________
